package com.jiang.daily.Q3349;

import java.util.List;

/**
 * @author Jiang
 * @version 1.0
 * @date 2025/10/14 15:26
 */
class Solution {
    public boolean hasIncreasingSubarrays(List<Integer> nums, int k) {
        if (k == 1) return true;
        int n = 1;
        int num = 1;
        for (int i = 1; i < nums.size(); i++) {
            if (nums.get(i) > nums.get(i - 1)) {
                num++;
                if (++n == 2 * k) return true;
            } else {
                if (num >= k) {
                    n = k + 1;
                } else {
                    n = 1;
                }
                num = 1;
            }
        }
        return false;
    }
}
